Local expansions, derivatives, and fixed points

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diagonal arguments and fixed points

‎A universal schema for diagonalization was popularized by N.S‎. ‎Yanofsky (2003)‎, ‎based on a pioneering work of F.W‎. ‎Lawvere (1969)‎, ‎in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function‎. ‎It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema‎. ‎Here‎, ‎we fi...

متن کامل

Local Computation of Simultaneous Fixed-Points*

We present a very simple, yet general algorithm for computing simultaneous, minimum fixed-points of monotonic functions, or turning the viewpoint slightly, an algorithm for computing minimum solutions to a system of monotonic equations. The algorithm is local (demand-driven, lazy, ), i.e. it will try to determine the value of a single component in the simultaneous fixed-point by investigating o...

متن کامل

Fully Local and Eecient Evaluation of Alternating Fixed Points ?

We introduce Partitioned Dependency Graphs (PDGs), an abstract framework for the speciication and evaluation of arbitrarily nested alternating xed points. The generality of PDGs subsumes that of similarly proposed models of nested xed-point computation such as Boolean graphs, Boolean equation systems, and the propositional modal mu-calculus. Our main result is an eecient local algorithm for eva...

متن کامل

Local negative circuits and fixed points in Boolean networks

To each Boolean function F : {0, 1} → {0, 1} and each point x ∈ {0, 1}, we associate the signed directed graph GF (x) of order n that contains a positive (resp. negative) arc from j to i if the discrete analogue of (∂fi/∂xj)(x) is positive (resp. negative). We then focus on the following open problem: Is the absence of a negative circuit in GF (x) for all x ∈ {0, 1} a sufficient condition for F...

متن کامل

Digital Fixed Points, Approximate Fixed Points, and Universal Functions

A. Rosenfeld [23] introduced the notion of a digitally continuous function between digital images, and showed that although digital images need not have fixed point properties analogous to those of the Euclidean spaces modeled by the images, there often are approximate fixed point properties of such images. In the current paper, we obtain additional results concerning fixed points and approxima...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fundamenta Mathematicae

سال: 1976

ISSN: 0016-2736,1730-6329

DOI: 10.4064/fm-91-1-1-4